The Problem of Reserved-lane for Hazardous Chemicals Transportation and Heuristic Algorithm
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولComparison between Combined and Separate Approaches for Solving a Location-Routing Problem in Hazardous Materials Transportation
In the case of hazardous materials management, selected routes for carrying hazardous materials (i.e., hazmat) have significant effects on locating hazmat distribution centers. Since, risk and cost are usually considered as two main attributes to determine the best routes, optimized locations are sequentially outlined depending on selected routes. In the present paper, t...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملThe Balanced Wheat Supply Problem and a Heuristic Algorithm
Wheat is a strategic commodity, and so its distribution system is always one of the major issues facing countries. The cost of wheat distribution and storage and the differences in the nutrient content of different wheats, have caused complicated problems in the wheat supply chain. In addition to controlling distribution costs, it could enhance the quality of wheat through blending different ki...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2015
ISSN: 2261-236X
DOI: 10.1051/matecconf/20152201031